Strong Complementary Acyclic Domination of a Graph
نویسندگان
چکیده
dominating set of G is called the strong complementary acyclic domination number of G and is denoted by ) (G st a c− γ . In this paper, we introduce and discuss the concept of strong complementary acyclic domination number of G.We determine this number for some standard graphs and obtain some bounds for general graphs. Its relationship with other graph theoretical parameters are also investigated.
منابع مشابه
Coverings, matchings and paired domination in fuzzy graphs using strong arcs
The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...
متن کاملAcyclic Weak Convex Domination in Graphs
In a graph G = (V, E), a set D ⊂ V is a weak convex dominating(WCD) set if each vertex of V-D is adjacent to at least one vertex in D and d < D > (u, v) = d G (u, v) for any two vertices u, v in D. A weak convex dominating set D, whose induced graph < D > has no cycle is called acyclic weak convex dominating(AWCD) set. The domination number γ ac (G) is the smallest order of a acyclic weak conve...
متن کاملPartitioned Graphs and Domination Related Parameters
Let G be a graph of order n ≥ 2 and n1, n2, .., nk be integers such that 1 ≤ n1 ≤ n2 ≤ .. ≤ nk and n1 + n2 + .. + nk = n. Let for i = 1, .., k: Ai ⊆ Kni where Km is the set of all pairwise non-isomorphic graphs of order m, m = 1, 2, ... In this paper we study when for a domination related parameter μ (such as domination number, independent domination number and acyclic domination number) is ful...
متن کاملHereditary domination and independence parameters
For a graphical property P and a graph G, we say that a subset S of the vertices of G is a P-set if the subgraph induced by S has the property P. Then the P-domination number of G is the minimum cardinality of a dominating P-set and the P-independence number the maximum cardinality of a P-set. We show that several properties of domination, independent domination and acyclic domination hold for ...
متن کاملHereditary Domination & Independence Parameters
For a graphical property P and a graph G, we say that a subset S of the vertices of G is a P-set if the subgraph induced by S has the property P. Then the P-domination number of G is the minimum cardinality of a dominating P-set and the P-independence number the maximum cardinality of a P-set. We show that several properties of domination, independent domination and acyclic domination hold for ...
متن کامل